Zero duality gap conditions via abstract convexity
نویسندگان
چکیده
Using tools provided by the theory of abstract convexity, we extend conditions for zero duality gap to context non-convex and nonsmooth optimization. Mimicking classical setting, an abst...
منابع مشابه
Conditions for zero duality gap in convex programming
We introduce and study a new dual condition which characterizes zero duality gap in nonsmooth convex optimization. We prove that our condition is weaker than all existing constraint qualifications, including the closed epigraph condition. Our dual condition was inspired by, and is weaker than, the so-called Bertsekas’ condition for monotropic programming problems. We give several corollaries of...
متن کاملA Duality Theory with Zero Duality Gap for Nonlinear Programming
Duality is an important notion for constrained optimization which provides a theoretical foundation for a number of constraint decomposition schemes such as separable programming and for deriving lower bounds in space decomposition algorithms such as branch and bound. However, the conventional duality theory has the fundamental limit that it leads to duality gaps for nonconvex optimization prob...
متن کاملPose Graph Optimization in the Complex Domain: Lagrangian Duality, Conditions For Zero Duality Gap, and Optimal Solutions
Pose Graph Optimization (PGO) is the problem of estimating a set of poses from pairwise relative measurements. PGO is a nonconvex problem, and currently no known technique can guarantee the computation of a global optimal solution. In this paper, we show that Lagrangian duality allows computing a globally optimal solution, under certain conditions that are satisfied in many practical cases. Our...
متن کاملThe Duality Gap for Two-Team Zero-Sum Games
We consider multiplayer games in which the players fall in two teams of size k, with payoffs equal within, and of opposite sign across, the two teams. In the classical case of k = 1, such zero-sum games possess a unique value, independent of order of play, due to the von Neumann minimax theorem. However, this fails for all k > 1; we can measure this failure by a duality gap, which quantifies th...
متن کاملConvexity, Duality and Effects
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new class of functors that we call ‘convex functors’; they include what are usually called probability distribution functors. These relationships take the form of three adjunctions. Two of these three are ‘dual’ adjunctions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2021
ISSN: ['0974-0988']
DOI: https://doi.org/10.1080/02331934.2021.1910694